Railway Station Shunting Scheduling Algorithm utilizing Case Based Reasoning
نویسندگان
چکیده
منابع مشابه
Shunting of Passenger Train Units in a Railway Station
In this paper we introduce the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not necessary to operate a given timetable. We discuss several aspects of this problem and focus on two subproblems. We propose mathematical models for these subproblems together with a solution method based on column generation. Furthermore, a new ...
متن کاملA Genetic Algorithm Based Railway Scheduling Model
In this paper we present an optimization model for train scheduling. This model constitutes one of the three major components of a solution approach for solving the transit network design problem. The problem of scheduling can be defined in the following general terms. Given the origin destination matrix for the train trips for design period, the underlying train network characterized by the ov...
متن کاملAutomatic generation of car shunting scheduling in railway car depots
A train schedule defines each train’s arrival/departure time at a car depot. Between the arrival and departure times, every train has to have its designated works, such as inspection and cleaning of the cars, completed, which are predefined by a car operation schedule. The planner of car shuntings at a car depot must create a schedule that satisfies the above-mentioned conditions, while also ta...
متن کاملRailway station route searching based on ACA
In the railway station signal system, the route searching algorithm is an important software module to realize the function safety of this system. In the paper, the ant colony algorithm is applied to the railway station route searching. Take the specific station route-the Wangzhai Station route for example to search the shortest route. The ideas of the Wangzhai Station route searching are put f...
متن کاملA Genetic Algorithm for Railway Scheduling Problems
This work is focused on the application of evolutionary algorithms to solve very complex real-world problems. For this purpose a Genetic Algorithm is designed to solve the Train Timetabling Problem. Optimizing train timetables on a single line track is known to be NP-hard with respect to the number of conflicts in the schedule. This makes it difficult to obtain good solutions to real life probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2002
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.122.6_1060